Optimal contact process on complex networks
نویسندگان
چکیده
منابع مشابه
Optimal contact process on complex networks.
Contact processes on complex networks are a recent subject of study in nonequilibrium statistical physics and they are also important to applied fields such as epidemiology and computer and communication networks. A basic issue concerns finding an optimal strategy for spreading. We provide a universal strategy that, when a basic quantity in the contact process dynamics, the contact probability ...
متن کاملVariability of Contact Process in Complex Networks
We study numerically how the structures of distinct networks influence the epidemic dynamics in contact process. We first find that the variability difference between homogeneous and heterogeneous networks is very narrow, although the heterogeneous structures can induce the lighter prevalence. Contrary to non-community networks, strong community structures can cause the secondary outbreak of pr...
متن کاملPhase transitions in the quadratic contact process on complex networks.
The quadratic contact process (QCP) is a natural extension of the well-studied linear contact process where infected (1) individuals infect susceptible (0) neighbors at rate λ and infected individuals recover (1→0) at rate 1. In the QCP, a combination of two 1's is required to effect a 0→1 change. We extend the study of the QCP, which so far has been limited to lattices, to complex networks. We...
متن کاملOptimal routing on complex networks
We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By usin...
متن کاملOptimal transport on complex networks.
We present a heuristic algorithm for the optimization of transport on complex networks. Previously proposed network transport optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to node congest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2008
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.78.066109